Free Resolutions and Sparse Determinantal Ideals
نویسنده
چکیده
A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In this paper we extend these results by computing a minimal free resolution for all such sparse determinantal ideals. We do so by introducing a technique for pruning minimal free resolutions when a subset of the variables is set to zero. Our technique correctly computes a minimal free resolution in two cases of interest: resolutions of monomial ideals, and ideals resolved by the Eagon-Northcott Complex. As a consequence we can show that sparse determinantal ideals have a linear resolution over Z, and that the projective dimension depends only on the number of columns of the matrix that are identically zero. We show this resolution is a direct summand of an Eagon-Northcott complex. Finally, we show that all such ideals have the property that regardless of the term order chosen, the Betti numbers of the ideal and its initial ideal are the same. In particular the nonzero generators of these ideals form a universal Gröbner basis.
منابع مشابه
Permanental Ideals
We show that the (2 × 2)-subpermanents of a generic matrix generate an ideal whose height, unmixedness, primary decomposition, the number and structure of the minimal components, resolutions, radical, integral closure and Gröbner bases all depend on the characteristic of the underlying subfield: if the characteristic of the subfield is two, this ideal is the determinantal ideal for which all of...
متن کاملSplittable Ideals and the Resolutions of Monomial Ideals
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with fuller generality, and at the same time, obtain new results. Past investigations on the resolutions of edge ideals usually reduced the problem to computing the di...
متن کاملCombinatorial Minimal Free Resolutions of Ideals with Monomial and Binomial Generators
In recent years, the combinatorial properties of monomials ideals [7, 10, 14] and binomial ideals [9, 10] have been widely studied. In particular, combinatorial interpretations of minimal free resolutions have been given in both cases. In this present work, we will generalize existing techniques to obtain two new results. The first is S[Λ]-resolutions of Λ-invariant submodules of k[Z] where Λ i...
متن کاملLinear Resolutions of Powers of Generalized Mixed Product Ideals
Let L be the generalized mixed product ideal induced by a monomial ideal I. In this paper we compute powers of the genearlized mixed product ideals and show that Lk have a linear resolution if and only if Ik have a linear resolution for all k. We also introduce the generalized mixed polymatroidal ideals and prove that powers and monomial localizations of a generalized mixed polymatroidal ideal...
متن کاملA characteristic-free example of a Lascoux resolution, and letter-place methods for intertwining numbers
Although Alain Lascoux and I never collaborated on a mathematical paper, his ideas have been a constant influence on my students’, my collaborators’ and my work ever since the appearance of the first draft of his doctoral thesis [12] His systematic use of characteristic-zero representation theory to find the resolutions of ideals generated by the minors, of any order, of generic matrices, impel...
متن کامل